An Iterative Morphological Decomposition Algorithm for Reduction Of Skeleton Points

An Explicit Viscosity Iterative Algorithm for Finding Fixed Points of Two Noncommutative Nonexpansive Mappings

We suggest an explicit viscosity iterative algorithm for finding a common element in the set of solutions of the general equilibrium problem system (GEPS) and the set of all common fixed points of two noncommuting nonexpansive self mappings in the real Hilbert space.  

Error Free Iterative Morphological Decomposition Algorithm for Shape Representation

Problem statement: A generalized skeleton transform allows a shape to be represented as a collection of modestly overlapped octagonal shape parts. One problem with several generalized Morphological skeleton transforms is that they generate noise after decomposition. The noise rate may not be effective for ordinary images; however this effect will be more when applied on printed or handwritten c...

Morphological reduction of skeleton redundancy

In this work we study morphological methods to reduce the amount of redundant points in the Skeleton representation of images. The advantage of removing redundant points using morphological operations only, lies in the computational eeciency of these operations, when implemented on parallel machines. We present a generic approach to obtain redundancy-reduced Skeletons, which yields morphologica...

An Iterative Heuristic Algorithm for Tree Decomposition

Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem and different algorithms have been proposed in the literature for generation of tree decompositions of small width. In this paper is presented new iterated local search algorithm to find good upper bounds for treewidth...

An iterative initial-points refinement algorithm for categorical data clustering